Point searching in real singularcomplete intersection varieties: algorithms of intrinsic complexity
نویسندگان
چکیده
منابع مشابه
Point searching in real singularcomplete intersection varieties: algorithms of intrinsic complexity
Let X1, . . . , Xn be indeterminates over Q and let X := (X1, . . . , Xn) . Let F1, . . . , Fp be a regular sequence of polynomials in Q[X] of degree at most d such that for each 1 ≤ k ≤ p the ideal (F1, . . . , Fk) is radical. Suppose that the variables X1, . . . , Xn are in generic position with respect to F1, . . . , Fp . Further suppose that the polynomials are given by an essentially divis...
متن کاملAlgorithms of Intrinsic Complexity for Point Searching in Compact Real Singular Hypersurfaces
For a real squarefree multivariate polynomial F , we treat the general problem of finding real solutions of the equation F = 0 , provided that the real solution set {F = 0}R is compact. We admit that the equation F = 0 may have singular real solutions. We are going to decide whether this equation has a non-singular real solution and, if this is the case, we exibit one for each generically smoot...
متن کاملPolar, bipolar and copolar varieties: Real solving of algebraic varieties with intrinsic complexity
This survey covers a decade and a half of joint work with L. Lehmann, G. M. Mbakop, and L. M. Pardo. We address the problem of finding a smooth algebraic sample point for each connected component of a real algebraic variety, being only interested in components which are generically smooth locally complete intersections. The complexity of our algorithms is essentially polynomial in the degree of...
متن کاملOn the intrinsic complexity of point finding in real singular hypersurfaces
In previous work we designed an efficient procedure that finds an algebraic sample point for each connected component of a smooth real complete intersection variety. This procedure exploits geometric properties of generic polar varieties and its complexity is intrinsic with respect to the problem. In the present paper we introduce a natural construction that allows to tackle the case of a non–s...
متن کاملAlgorithms for Some Intersection Searching Problems Involving Curved Objects
Two classes of geometric intersection searching problems are considered i e problems in which a set S of geometric objects is to be preprocessed into a data structure so that for any query object q the objects of S that are intersected by q can be counted or reported e ciently In the rst class S is a set of curved objects such as d balls d spheres circles or circular arcs and q is also a curved...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 2013
ISSN: 0025-5718,1088-6842
DOI: 10.1090/s0025-5718-2013-02766-4